Abstract Riemann sum

Sum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem

In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.

Sum of Abstract Domains

In the abstract interpretation theory, program properties are encoded by abstract domains, and the combination of abstract domains leads to new properties to be analyzed. We propose a new method to combine numerical abstract domains based on the Minkowski sum. We provide a general framework equipped with all the necessary abstract operators for static analysis of imperative languages.

Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract)

The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...

An Asymptotic Formula for a Sum Involving Zeros of the Riemann Zeta-function

E. Landau gave an interesting asymptotic formula for a sum involving zeros of the Riemann zeta-function. We give an asymptotic formula which can be regarded as a smoothed version of Landau’s formula.

abstract